ITU-PRP: Parallel and Distributed Computing Middleware for Java Developers

ITU-PRP provides a Parallel Programming Framework for Java Developers on which they can adapt their sequential application code to operate on a distributed multi-host parallel environment. Developers would implement parallel models, such as Loop Parallelism, Divide and Conquer, Master-Slave and Fork-Join by the help of an API Library provided under framework. Produced parallel applications would be submitted to a middleware called Parallel Running Platform (PRP), on which parallel resources for parallel processing are being organized and performed. The middleware creates Task Plans (TP) according to application’s parallel model, assigns best available resource Hosts, in order to perform fast parallel processing. Task Plans will be created dynamically in real time according to resources actual utilization status or availability, instead of predefined/preconfigured task plans. ITU-PRP achieves better efficiency on parallel processing over big data sets and distributes divided base data to multiple hosts to be operated by Coarse-Grained parallelism. According to this model distributed parallel tasks would operate independently with minimal interaction until processing ends

ITU-PRP: Parallel and Distributed Computing Middleware for Java Developers

ITU-PRP provides a Parallel Programming Framework for Java Developers on which they can adapt their sequential application code to operate on a distributed multi-host parallel environment. Developers would implement parallel models, such as Loop Parallelism, Divide and Conquer, Master-Slave and Fork-Join by the help of an API Library provided under framework. Produced parallel applications would be submitted to a middleware called Parallel Running Platform (PRP), on which parallel resources for parallel processing are being organized and performed. The middleware creates Task Plans (TP) according to application’s parallel model, assigns best available resource Hosts, in order to perform fast parallel processing. Task Plans will be created dynamically in real time according to resources actual utilization status or availability, instead of predefined/preconfigured task plans. ITU-PRP achieves better efficiency on parallel processing over big data sets and distributes divided base data to multiple hosts to be operated by Coarse-Grained parallelism. According to this model distributed parallel tasks would operate independently with minimal interaction until processing ends

Source-initiated geographical data flow approach for wireless ad hoc and sensor networks

Tasarsız (ad hoc) ve duyarga (sensör) ağlar, altyapısız ağlar olduğu için altyapılı ağlarda bol miktarda bulunan enerji, işlemci, bellek, bandgenişliği gibi kaynaklar kısıtlıdır ve özenle tüketilmelidir. Ağ elemanlarının boyutlarının çok küçük olması, enerjiyi en kısıtlı kaynak yapmaktadır. Ancak, kaynak ile varış arasında veri akışının sağlanması için kullanılan yöntemler enerji tüketimini arttırmaktadır. Bu nedenle, literatürde enerji-etkin yönlendirme protokolleri sunulmuştur. Bu protokollerden, coğrafi yer bilgisine dayanarak yönlendirme yapan protokoller, diğerlerine göre daha yüksek başarıma ve performans değerlerine sahiptir. Bu çalışmada, Durumsuz Ağırlıklı Yönlendirme (DAY) isimli bir özgün kaynak-başlatmalı veri akış tekniği sunulmaktadır. Düğümler sadece kendi sanal coğrafi yer bilgilerini bilmekte, ağ topololoji bilgisine ihtiyaç duymamaktadır. Her düğüm kendi ağırlığını hesaplamaktadır. Başlangıçta bu değer varışa olan mesafedir. Düğümler kendilerine gelen paketlerin içindeki ağırlık bilgilerine bakarak paketi tekrar göndermeye veya düşürmeye karar vermektedir. Bu karşılaştırma işlemi durumsuz olma özelliğini sağlamaktadır. Ağırlık parametresi sadece yer bilgisini içerebildiği gibi düğümün kalan enerjisi gibi Servis Kalitesi parametre bilgisini de içerebilir. Servis Kalite bilgisi sistemin yaşamömrünü arttırmaya yöneliktir. Durumsuz olma özelliği ile de, yönlendirme tablosu tutulan algoritmalarda görülen iletişim yükü büyük oranda azalmaktadır. DAY, aynı zamanda, güvenirliği sağlayan ve gerçek-zamanlı veri için de gerekli olan çoklu-yollar veya örülü çoklu-yollar kullanır. Tekrar-gönderimlerde eşik değerlerinin kullanımı, sistemde esnek ve enerji etkin bir veri akışı sağlar. Aynı zamanda, DAY, MAC-katmanından bağımsız çalışan ilk durumsuz coğrafi yönlendirme tekniğidir.                                                    Anahtar Kelimeler: Kablosuz ağlar, gezgin ağlar, sensör ağlar, iletişim, yol atama, yönlendirme. Routing without tables can be achieved by using location information of the nodes retrieved from GPS (Global Positioning System) or by applying a localization algorithm. In geographic routing protocols, nodes know their actual or relative positions with respect to a reference point, and share this information with immediate neighbour nodes for routing process. Geographic routing protocols use only local topology information and do not have any update overhead. Therefore, they provide scalability in mobile networks with respect to conventional routing protocols. Geographic routing protocols use greedy scheme or beaconless scheme for routing. In greedy schemes, nodes select the best next node on the route by using the local topology information. Collecting local topology information in greedy schemes consumes more energy than beaconless schemes due to reduced transmissions in the latter one. On the other hand, beaconless routing protocols in the literature propose solutions to be implemented at the MAC (Medium Access Control) layer. In those solutions, RTS (Request To Send) and CTS (Clear To Send) packets are also used for implementing routing protocol that increases the complexity of the MAC layer. However, sorting routing problem at the MAC layer is against the well-defined communication architecture. Besides that, those solutions become dependent to the MAC layer they use. In this study, a novel stateless data flow approach and routing algorithm for wireless sensor networks is proposed which is completely MAC-layer independent. Nodes do not have to be aware of local or global topology information. Routing is achieved without keeping tables. Nodes geographical positions are sufficient for routing process. A new metric called weight that is derived from nodes own position is used in routing process. The position can be either geographical or relative to a reference point system wide. Instead of the position, the weight value of the transmitting node is inserted into the packet. Each node on the route involves in routing process by considering its weight and the information in the received packet. To limit the number of forwarding nodes, a threshold is set in terms of the weight metric. On a packet receive; a node broadcasts the packet if its weight is between the weights of the transmitting node and the destination node and if also its weight difference greater than the threshold value. Besides that, decision to transmit includes QoS parameters such as power-left at the node to keep energy-limited nodes out of the route. The threshold value can be adjusted to save energy by limiting the number of retransmitting nodes. The threshold value can also be adjusted for reliability. More relaying in number causes the data to flow over multiple paths. Data transportation over multiple paths provides reliability. Reliability requirements challenge with the energy saving requirements. Therefore, threshold value can be used to balance these requirements as needs. Thirdly, the threshold value can be adjusted for void recovery. In case of void detection, the transmitting node decreases the threshold value allowing more nodes to be in data flow algorithm. By this way, nodes that may circumvent the void are forced to relay the data packets. Fourthly, the threshold value should be adjusted according to the node density in the network. In dense networks, the threshold value can be set to be high by default to limit the retransmitting nodes. In non-dense networks, the threshold value can be set to be low. The proposed algorithm, SWR, has the followingproperties:  SWR provides scalability by not using routing tables, and by not beaconing. SWR simplifies routing process by using a weight metric and designing an appropriate algorithm for routing. SWR decreases calculations, delay, and resource requirements (such as processor and memory) at nodes by using weight metric. SWR decreases energy consumption by not beaconing, by using position-based routing based on threshold and considering the energy levels of the nodes.  SWR provides reliability by using multipaths. SWR executes routing process completely in network layer, independent from the MAC layer used below.  Keywords: Wireless networks, mobile networks, sensor networks, communications, routing, network layer.

ML-PVA User's Manual (Version 1.1)

This document has been prepared to help MonaLisa Parallel Video Accelerator (ML-PVA) users in program development and running . It explains only the basic concepts. Further details exist in the forms of reports, manuals, and published papers given in the Bibliography section. MonaLisa ( Modelling NAturaL Images for Synthesis and Animation) is a EU supported RACE II project whose main goal is to develop a virtual reality platform by means of both hardware and software, for TV studio production and post production by mixing environment for using synthetically generated images and real images together. ML-PVA, the parallel architecture for video processing has been developed at Queen Mary and Westfield College (QMW) under MonaLisa project. This manual replaces the first version of "MonaLisa Accelerator User's Manual" , written by A V Sahiner and P Lefloch. However, to support the previously developed applications, the former directory structures has been kept. Users are expected to follow this manual from now on, eventhough backward support exists. Although ML-PVA is the actual parallel machine, there are two more separate platforms, performing different tasks, to build the complete system. The first one is a standard workstation running a number of user interface programs. The second one is a PC for compiling DSP programs. They are all attached to Ethernet and they all have TCP/IP based communication support. This manual explains the systems information upto Section 6. Programming ML-PVA is the main concern of the Section 6 and 7. Thus a user having systems information and willing to exercise programming could skip the first six chapter and begin with the Section 6. For any further help concerning the use of actual machine, providing related documentation send an email to..

Optimal Scheduling Algorithms for Communication Constrained Parallel Processing

With the advent of digital TV and interactive multimedia over broadband networks, the need for high performance computing for broadcasting is stronger than ever. Processing a digital video sequence requires considerable computing. One of the ways to cope with the demands of video processing in real-time, we believe, is parallel processing